On the radio number of toroidal grids
نویسندگان
چکیده
A radio coloring of a simple connected graph G is a mapping f : V (G) → {0, 1, 2, . . .} such that |f(u)− f(v)| diam(G)+1−d(u, v) for each pair of distinct vertices u and v of G, where diam(G) is the diameter of G and d(u, v) is the distance between u and v in G. The span of a radio coloring f , span(f), is the number maxu∈V (G) f(u). The radio number of G, rn(G), is defined as minf{span(f) : f is a radio coloring of G}. In this paper, we determine the radio number of the toroidal grid Tm,n (the cartesian product of cycle Cm with the cycle Cn), when at least one of m and n is an even integer. Furthermore, a lower bound is given for the same when both m and n are odd integers.
منابع مشابه
Cops and robber on grids and tori
This paper is a contribution to the classical cops and robber problem on a graph, directed to two-dimensional grids and toroidal grids. These studies are generally aimed at determining the minimum number of cops needed to capture the robber and proposing algorithms for the capture. We apply some new concepts to propose a new solution to the problem on grids that was already solved under a diffe...
متن کاملSpectrum Assignment in Cognitive Radio Networks Using Fuzzy Logic Empowered Ants
The prevalent communications networks suffer from lack of spectrum and spectrum inefficiency. This has motivated researchers to develop cognitive radio (CR) as a smart and dynamic radio access promised solution. A major challenge to this new technology is how to make fair assignment of available spectrum to unlicensed users, particularly for smart grids communication. This paper introduces an i...
متن کاملOn independent domination numbers of grid and toroidal grid directed graphs
A subset $S$ of vertex set $V(D)$ is an {em indpendent dominating set} of $D$ if $S$ is both an independent and a dominating set of $D$. The {em indpendent domination number}, $i(D)$ is the cardinality of the smallest independent dominating set of $D$. In this paper we calculate the independent domination number of the { em cartesian product} of two {em directed paths} $P_m$ and $P_n$ for arbi...
متن کاملMinimum Tenacity of Toroidal graphs
The tenacity of a graph G, T(G), is dened by T(G) = min{[|S|+τ(G-S)]/[ω(G-S)]}, where the minimum is taken over all vertex cutsets S of G. We dene τ(G - S) to be the number of the vertices in the largest component of the graph G - S, and ω(G - S) be the number of components of G - S.In this paper a lower bound for the tenacity T(G) of a graph with genus γ(G) is obtained using the graph's connec...
متن کاملOn list vertex 2-arboricity of toroidal graphs without cycles of specific length
The vertex arboricity $rho(G)$ of a graph $G$ is the minimum number of subsets into which the vertex set $V(G)$ can be partitioned so that each subset induces an acyclic graph. A graph $G$ is called list vertex $k$-arborable if for any set $L(v)$ of cardinality at least $k$ at each vertex $v$ of $G$, one can choose a color for each $v$ from its list $L(v)$ so that the subgraph induced by ev...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Australasian J. Combinatorics
دوره 55 شماره
صفحات -
تاریخ انتشار 2013